Classification of regular embeddings of hypercubes of odd dimension

نویسندگان

  • Shao-Fei Du
  • Jin Ho Kwak
  • Roman Nedela
چکیده

By a regular embedding of a graph into an orientable surface we mean a 2cell embedding with the automorphism group acting regularly on arcs. In 1997 Nedela and Škoviera [Europ. J. Comb. 18, 807-823] presented a construction giving for each solution of the congruence e2 ≡ 1(mod n) a regular embedding Me of the hypercube Qn. It was conjectured that all regular embeddings of Qn can be constructed in this way. This paper gives a classification of regular embeddings of hypercubes Qn for n odd. The conjecture is confirmed affirmatively for every odd n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular Polytopes in Z

In [3], all embeddings of regular polyhedra in the three dimensional integer lattice were characterized. Here, we prove some results toward solving this problem for all higher dimensions. Similarly to [3], we consider a few special polytopes in dimension 4 that do not have analogues in higher dimensions. We then begin a classification of hypercubes, and consequently regular cross polytopes in t...

متن کامل

On Subgraphs in Distance-Regular Graphs

Terwilliger [15] has given the diameter bound d < (s 1)(k 1) + 1 for distance-regular graphs with girth 2s and valency k. We show that the only distance-regular graphs with even girth which reach this bound are the hypercubes and the doubled Odd graphs. Also we improve this bound for bipartite distance-regular graphs. Weichsel [17] conjectures that the only distance-regular subgraphs of a hyper...

متن کامل

Regular Embeddings of Canonical Double Coverings of Graphs

This paper addresses the question of determining, for a given graph G, all regular maps having G as their underlying graph, i.e., all embeddings of G in closed surfaces exhibiting the highest possible symmetry. We show that if G satisfies certain natural conditions, then all orientable regular embeddings of its canonical double covering, isomorphic to the tensor product G K2 , can be described ...

متن کامل

A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes

Embeddings of several graph classes into hypercubes have been widely studied. Unfortunately, almost all investigated graph classes are regular graphs such as meshes, complete trees, pyramids. In this paper, we present a general method for one-to-one embedding irregular graphs into their optimal hypercubes based on extended-edge-bisectors of graphs. An extended-edge-bisector is an edge-bisector ...

متن کامل

Hypercube Embeddings of Wythoffians

The Wythoff construction takes a d-dimensional polytope P , a subset S of {0, . . . , d} and returns another d-dimensional polytope P (S). If P is a regular polytope, then P (S) is vertex-transitive. This construction builds a large part of the Archimedean polytopes and tilings in dimension 3 and 4. We want to determine, which of those Wythoffians P (S) with regular P have their skeleton or dua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 307  شماره 

صفحات  -

تاریخ انتشار 2007